The Malleability of TSP_{2Opt}
نویسندگان
چکیده
We prove that the local search optimization problem TSP 2Opt |though not known to be PLS-complete|shares an important infeasibility property with other PLS-complete sets.
منابع مشابه
A new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملThe 0-1 inverse maximum stable set problem
In this paper we study the 0-1 inverse maximum stable set problem, denoted by IS{0,1}. Given a graph and a stable set (not necessarily maximum), it is to delete a minimum number of vertices to make the given stable set maximum in the new graph. We also consider IS{0,1} against a specific algorithm such as Greedy and 2opt, which is denoted by IS{0,1},greedy and IS{0,1},2opt, respectively. We pro...
متن کاملFitness Landscape and the Behavior of
This paper focuses on using the tness landscape paradigm in order to gain a better understanding of the behavior local search heuristics in order to sove NP-hard problems. We concentrate ourselves on the TSP and we compare experimental facts about landscapes associated with the well-known 2opt-move and city-swap operators. We measure the \\tness-distance correlation" (FDC), i.e. the correlation...
متن کاملAlternatives to Non-Malleability: Definitions, Constructions and Applications
We explore whether non-malleability is necessary for the applications typically used to mo-tivate it, and propose two alternatives. The first we call weak non-malleability (wnm) and showthat it suffices to achieve secure contract bidding (the application for which non-malleability wasinitially introduced), despite being strictly weaker than non-malleability. The second we callta...
متن کاملQuantum Non-malleability and Authentication
In encryption, non-malleability is a highly desirable property: it ensures that adversaries cannot manipulate the plaintext by acting on the ciphertext. In [5], Ambainis et al. gave a definition of non-malleability for the encryption of quantum data. In this work, we show that this definition is too weak, as it allows adversaries to “inject” plaintexts of their choice into the ciphertext. We gi...
متن کامل